An Efficient (n − t)-out-of-n Threshold Ring Signature Scheme

نویسندگان

  • Toshiyuki Isshiki
  • Keisuke Tanaka
چکیده

In this paper, we propose an efficient (n − t)-out-of-n threshold ring signature scheme which is efficient when t is small compared with n. Our scheme has a kind of dual structure of the Bresson– Stern–Szydlo threshold ring signature scheme [2], which is infeasible when t is small compared with n. In particular, we modify the trap-door one-way permutations in the ring signature scheme, and use a combinatorial notion called fair partition. Our scheme is provably secure in the random oracle model. keywords: ring signature, threshold signature

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Threshold Ring Signatures in the Random Oracle Model

We improve on the Bresson–Stern–Szydlo threshold ring signature scheme which uses Shamir secret sharing scheme [6] by showing that the security can be proved under a strictly weaker assumption, that is the random oracle model rather than the ideal cipher model. Then we propose an efficient (n− t)-out-of-n threshold ring signature scheme which is efficient when t is small compared with n. Our sc...

متن کامل

An Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves

‎In a (t,n)-threshold secret sharing scheme‎, ‎a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together‎, ‎but no group of fewer than t participants can do‎. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao‎, ‎and the intractability of the elliptic curve discrete logar...

متن کامل

Improved Lattice-Based Threshold Ring Signature Scheme

We present in this paper an improvement of the lattice-based threshold ring signature proposed by Cayrel, Lindner, Rückert and Silva (CLRS) [LATINCRYPT ’10]. We generalize the same identification scheme CLRS to obtain a more efficient threshold ring signature. The security of our scheme relies on standard lattice problems. The improvement is a significant reduction of the size of the signature....

متن کامل

Identity Based Threshold Ring Signature

In threshold ring signature schemes, any group of t entities spontaneously conscript arbitrarily n − t entities to generate a publicly verifiable t-out-of-n signature on behalf of the whole group, yet the actual signers remain anonymous. The spontaneity of these schemes is desirable for ad-hoc groups such as mobile ad-hoc networks. In this paper, we present an identity based (ID-based) threshol...

متن کامل

A Threshold Ring Signature Scheme with a Variety of Keys

In this paper we present a (t, n)-ring signature scheme in which each ring member can use a different underlying signature scheme. The scheme is existentially secure in the random oracle model against adaptive chosenmessage attacks in which an adversary may corrupt up to t−1 ring members, under the security assumptions of the underlying signature schemes for each ring member. The threshold sign...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008